Characterizing large cardinals in terms of layered posets
نویسندگان
چکیده
Given an uncountable regular cardinal κ, a partial order is κstationarily layered if the collection of regular suborders of P of cardinality less than κ is stationary in Pκ(P). We show that weak compactness can be characterized by this property of partial orders by proving that an uncountable regular cardinal κ is weakly compact if and only if every partial order satisfying the κ-chain condition is κ-stationarily layered. We prove a similar result for strongly inaccessible cardinals. Moreover, we show that the statement that all κ-Knaster partial orders are κ-stationarily layered implies that κ is a Mahlo cardinal and every stationary subset of κ reflects. This shows that this statement characterizes weak compactness in canonical inner models. In contrast, we show that it is also consistent that this statement holds at a non-weakly compact cardinal.
منابع مشابه
On the indestructibility aspects of identity
We investigate the indestructibility properties of strongly compact cardinals in universes where strong compactness suffers from identity crisis. We construct an iterative poset that can be used to establish Kimchi-Magidor theorem from [22], i.e., that the first n strongly compact cardinals can be the first n measurable cardinals. As an application, we show that the first n strongly compact car...
متن کاملMad families, splitting families and large continuum
Let κ < λ be regular uncountable cardinals. Using a finite support iteration of ccc posets we obtain the consistency of b = a = κ < s = λ. If μ is a measurable cardinal and μ < κ < λ, then using similar techniques we obtain the consistency of b = κ < a = s = λ.
متن کاملSe p 20 17 REVERSIBLE SEQUENCES OF CARDINALS , REVERSIBLE EQUIVALENCE RELATIONS , AND SIMILAR STRUCTURES
A relational structure X is said to be reversible iff every bijective endomorphism f : X → X is an automorphism. We define a sequence of non-zero cardinals 〈κi : i ∈ I〉 to be reversible iff each surjection f : I → I such that κj = ∑ i∈f[{j}] κi, for all j ∈ I , is a bijection, and characterize such sequences: either 〈κi : i ∈ I〉 is a finite-to-one sequence, or κi ∈ N, for all i ∈ I , K := {m ∈ ...
متن کاملIndestructibility of Generically Strong Cardinals
Foreman [For13] proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of ω1 is preserved by any proper forcing. We generalize portions of Foreman’s Duality Theorem to the context of generic extender embeddings and ideal extenders (as introduced by Claverie [Cla10]). As an ...
متن کاملQuotients of strongly Proper Forcings and Guessing Models
We prove that a wide class of strongly proper forcing posets have quotients with strong properties. Specifically, we prove that quotients of forcing posets which have universal strongly generic conditions on a stationary set of models by certain nice regular suborders satisfy the ω1-approximation property. We prove that the existence of stationarily many ω1-guessing models in Pω2 (H(θ)), for su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 168 شماره
صفحات -
تاریخ انتشار 2017